Hamiltonian path problem - PDFSEARCH.IO - Document Search Engine

Hamiltonian path problem
Results: 50

#	Item
21	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:12 Eulerian path NP-complete problems BEST theorem Degree Connectivity Hamiltonian path Tree Graph Route inspection problem Graph theory Mathematics Theoretical computer science
22	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:20 Eulerian path Route inspection problem Graph Matching Line graph Hamiltonian path Graph theory Planar graphs NP-complete problems
23	arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-07-06 20:12:57 Matching Eulerian path Petersen graph Travelling salesman problem Graph Tree Chordal graph Hamiltonian path Planar graph Graph theory NP-complete problems Cubic graph
24	Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-03 17:31:15 Planar graphs Network theory Directed acyclic graph Graph coloring Shortest path problem Hypercube graph Planarity testing Hamiltonian path Tree Graph theory Theoretical computer science NP-complete problems
25	Eindhoven Honours Class Foundations of Informatics Algorithmic Adventures Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2010-12-13 10:02:09 Complexity classes Molecular biology DNA Classes of computers Leonard Adleman DNA computing Natural computing Turing machine Hamiltonian path problem Theoretical computer science Applied mathematics Mathematics
26	Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-04-25 00:45:46 NP-complete problems Operations research Combinatorial optimization Travelling salesman problem Cubic graph Hamiltonian path Gadget Degree Regular graph Graph theory Theoretical computer science Mathematics
27	Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study Jeremy Franky and Ian P. Gentz and Toby Walshz August 15, 1997 analysis of algorithms, computational complexity, phase tra Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 02:03:45 NP-complete problems Hamiltonian path Shortest path problem NP-complete Asymptotic analysis Graph coloring Graph Computational complexity theory Random graph Graph theory Theoretical computer science Mathematics
28	Chapter 3 Reconstructing DNA 3.1 Introduction Add to Reading List Source URL: www.liacs.nl Language: English - Date: 2009-07-03 16:04:35 NP-complete problems Search algorithms Operations research Travelling salesman problem Hamiltonian path Tree Routing algorithms Bellman–Ford algorithm Binary tree Theoretical computer science Mathematics Graph theory
29	9780199233212_Moore_&_Mertens.pdf Add to Reading List Source URL: fdslive.oup.com Language: English - Date: 2013-09-30 10:01:30 NP-complete problems Eulerian path Hamiltonian path Graph connectivity Seven Bridges of Königsberg Travelling salesman problem Degree Path Cycle Graph theory Mathematics Theoretical computer science
30	Choose Your Best Way Page < PAGE >4 of < NUMPAGES >4 Developed by IEEE as part of TryEngineering Add to Reading List Source URL: www.tryengineering.org Language: English - Date: 2013-12-09 20:23:19 Network theory NP-complete problems Shortest path problem Hamiltonian path Eulerian path Distance Graph Petersen graph Widest path problem Graph theory Mathematics Theoretical computer science

UPDATE